D* lite algorithm based path planning of mobile robot in static Environment
نویسندگان
چکیده
منابع مشابه
D* lite algorithm based path planning of mobile robot in static Environment
In this paper, we study the path planning for khepera II mobile robot in an unknown environment. The well known heuristic D* lite algorithm is implemented to make the mobile robot navigate through static obstacles and find the shortest path from an initial position to a target position by avoiding the obstacles. and to perform efficient re-planning during exploration. The proposed path finding ...
متن کاملMobile Robot Path Planning in Static Environment using Modified A* (MA*) Algorithm
Path planning is one of the most important issues in mobile robots since it determines the intelligence of robots. It is about finding the shortest, collision free and smooth path form predefined start point to fixed target point with the presence of obstacles either static or dynamic. In this paper, we present a new approach of artificial intelligence for mobile robot. The proposed approach fo...
متن کاملNavigation of PIC based mobile robot using path planning algorithm
A robot is usually an electro-mechanical machine which is guided by computer or electronic programming. Conventional line tracer robots follow path in given map. In some kind of robots path is already store in its memory and it simply follows that path. When such types of robots are left to traverse through any random maze, these robots tend to traverse all possible paths every time having no f...
متن کاملPath Planning Algorithm for Mobile Robot
The paper presents an algorithm for planning the path of a mobile robot in a labyrinth. The algorithm uses an image, obtained by a camera. The algorithm processes the image to convert it into a matrix, presenting the labyrinth with obstacles and walls. Afterwards the algorithm finds the shortest path to a final target in the labyrinth. As opposed to the classical Dijkstra’s algorithm, the prese...
متن کاملMobile Robot Dynamic Path Planning Based on Genetic Algorithm
In dynamic environment, the path planning of mobile robot is a problem difficult to solve. A path planning method for mobile robot based on genetic algorithm is put forward. This method makes use of real number coding and adaptive function with definite physical meaning in the dynamic environment so as to accelerate real-time calculation and improve calculation precision. The simulation result ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer and Communication Technology
سال: 2012
ISSN: 2231-0371,0975-7449
DOI: 10.47893/ijcct.2012.1158